Search Results
Jakub Tarnawski: Approximation Algorithms for the (Asymmetric) Traveling Salesman Problem
The Travelling Salesman Problem (ft. Ola Svensson & Jakub Tarnawski)
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
STOC 2018 talk: Constant-Factor Approximation for Asymmetric Traveling Salesman Problem
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
How the ATSP Breakthrough was Made (ft. Ola Svensson & Jakub Tarnawski)
Breakthrough in Asymmetric TSP (ft. Ola Svensson & Jakub Tarnawski)
TCS+ talk: Ola Svensson
Ola Svensson @ Theory Lunch
Improved Approximation Algorithms for the TSP and S-t-path TSP
[15.07.2020] Jakub Tarnawski - Hierarchy-Based Algorithms for Minimizing Makespan under ...
László Végh: A constant-factor approximation algorithm for the asymmetric tsp (Part I)
![[15.07.2020] Jakub Tarnawski - Hierarchy-Based Algorithms for Minimizing Makespan under ...](https://img.youtube.com/vi/Wd4IbLvYVxg/hqdefault.jpg)
